Characterizations of the Set Less Order Relation in Nonconvex Set Optimization
نویسندگان
چکیده
Abstract For nonconvex set optimization problems based on the less order relation, this paper presents characterizations of optimal sets and gives necessary conditions for inequalities non-optimal using directional derivatives. specific cones, derivatives known functionals describing negative cones are also given.
منابع مشابه
Directional Derivatives in Set Optimization with the Set Less Order Relation
Based on a special concept of the difference of sets, a new notion of the directional derivative of a set-valued map is presented. This theory is applied to set optimization problems with the known set less order relation, and it results in necessary and sufficient optimality conditions.
متن کاملA RELATION BETWEEN THE CATEGORIES Set * , SetT, Set AND SetT
In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.
متن کاملHigher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
Unfortunately, the incorrect version of [1, Theorem 4.3] was published. The correct version of [1, Theorem 4.3] is given in this paper. By employing the generalized higher-order contingent derivatives of set-valued maps, Wang et al. [1] established a sufficient optimality condition of weakly efficient solutions for (SV P): (SV P) min F(x), s.t. G(x) (−D) = ∅, x ∈ E. Theorem 1 (see [1, Theorem 4...
متن کاملa relation between the categories set * , sett, set and sett
in this article, we have shown, for the add-point monad t, thepartial morphism category set*is isomorphic to the kleisli category sett. alsowe have proved that the category, sett, of t-algebras is isomorphic to thecategory set of pointed sets. finally we have established commutative squaresinvolving these categories.
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2022
ISSN: ['0022-3239', '1573-2878']
DOI: https://doi.org/10.1007/s10957-021-01985-x